Maximizing Profit in Green Cellular Networks through Collaborative Games

In this paper, we deal with the problem of maximizing the profit of Network Operators (NOs) of green cellular networks in situations where Quality-of-Service (QoS) guarantees must be ensured to users, and Base Stations (BSs) can be shared among different operators. We show that if NOs cooperate among them, by mutually sharing their users and BSs, then each one of them can improve its net profit. By using a game-theoretic framework, we study the problem of forming stable coalitions among NOs. Furthermore, we propose a mathematical optimization model to allocate users to a set of BSs, in order to reduce costs and, at the same time, to meet user QoS for NOs inside the same coalition. Based on this, we propose an algorithm, based on cooperative game theory, that enables each operator to decide with whom to cooperate in order to maximize its profit. This algorithms adopts a distributed approach in which each NO autonomously makes its own decisions, and where the best solution arises without the need to synchronize them or to resort to a trusted third party. The effectiveness of the proposed algorithm is demonstrated through a thorough experimental evaluation considering real-world traffic traces, and a set of realistic scenarios. The results we obtain indicate that our algorithm allows a population of NOs to significantly improve their profits thanks to the combination of energy reduction and satisfaction of QoS requirements.Comment: Added publisher info and citation notic

Solution of Ulam's problem on binary search with three lies

AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most three of the answers may be erroneous

Advertisement Delivery and Display in Vehicular Networks: Using V2V Communications for Targeted Ads

Advertisement delivery is expected to play a crucial role in future vehicular networks. In this paper, we address such a problem in vehicular networks, where advertisements (ads) can be broadcasted by roadside units (RSU) as well as vehicles, and then displayed to interested users. We describe the advertisement dissemination process by means of an optimization model that aims at maximizing the number of ads that users display within the target area and validity period of the ad. We then solve the optimization problem, obtaining the optimal scheduling strategy that RSUs and vehicles should adopt for ad broadcasting. Our study highlights the important role that vehicle-to-vehicle communication will have in ads delivery. Also, it shows how coexisting vehicular and cellular networks can effectively complement each other, with vehicular networks being a very efficient means for pervasive ad dissemination